Group-based cryptography
ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
top
Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes use groups in some way. In particular DiffieβHellman key exchange uses finite cyclic groups. So the term group-based cryptography refers mostly to cryptographic protocols that use infinite non-abelian groups such as a braid group.
Contents
β’ Examples
β’ See also
β’ References
β’ Further reading
β’ External links
ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
Examples
β’ ShpilrainβZapata public-key protocols
β’ MagyarikβWagner public key protocol
β’ KoβLee et al. key exchange protocol
See also
References
β’ citerefmyasnikovshpilrainushakov2008Myasnikov, A.G.; Shpilrain, V.; Ushakov, A. (2008). Group-based Cryptography. Advanced Courses in Mathematics β CRM Barcelona. Birkhauser. ISBN 9783764388270.
β’ citerefmyasnikovshpilrainushakov2011Myasnikov, A.G.; Shpilrain, V.; Ushakov, A. (2011). Non-commutative cryptography and complexity of group-theoretic problems. Amer. Math. Soc. Surveys and Monographs. ISBN 9780821853603.
β’ citerefkoleecheonhan2000Ko, K.H.; Lee, S.J.; Cheon, J.H.; Han, J.W.; Kang, J.; Park, C. (2000). "New public-key cryptosystem using braid groups". Advances in CryptologyβCRYPTO 2000. Lecture Notes in Computer Science. Vol. 1880. Springer. pp. 166β183. CiteSeerX 10.1.1.85.5306. doi:10.1007/3-540-44598-6_10. ISBN 978-3-540-44598-2.
Further reading
β’ Paul, Kamakhya; Goswami, Pinkimani; Singh, Madan Mohan. (2022). "ALGEBRAIC BRAID GROUP PUBLIC KEY CRYPTOGRAPHY", Jnanabha, Vol. 52(2) (2022), 218-223. ISSN 0304-9892 (Print) ISSN 2455-7463 (Online)
External links